More Di fferential Paths of TIB3
نویسندگان
چکیده
The TIB3-256 hashing algorithm [3] is a first round candidate in the SHA-3 competition [2]. Properties of the message expansion and the PHTX function are observed, and then exploited to create new high-probability differential paths through the compression function. Examples conforming to the differential paths are presented. Only one of these differential paths can be applied to the tweaked version of TIB3v2 [4]. Due to the dual-block input mode used in TIB3 and TIB3v2, these differential paths do not seem extensible to the full hash functions. Note: In the time between when this paper was written and when the paper was made public, the SHA-3 Round 2 Candidates were announced, and TIB3 had been eliminated from the competition.
منابع مشابه
An Improved Truncated Di fferential Cryptanalysis of KLEIN
KLEIN is a family of lightweight block ciphers which proposed at RFIDSec 2011 by Gong et. al. It has a 64-bit state and 64, 80 or 96-bit key size which introduce its version. It uses 16 same 4-bit Sboxes combined with two AES’s MixColumn transformations for each round. This approach allows compact implementations of KLEIN in both low-end software and hardware. Such an innovative combination att...
متن کاملOn Free-Start Collisions and Collisions for TIB3
In this paper, we present free-start collisions for the TIB3 hash functions with a complexity of about 2 compression function evaluations. By using message modification techniques the complexity can be further reduced to 2. Furthermore, we show how to construct collisions for TIB3 slightly faster than brute force search using the fact that we can construct several (different) free-start collisi...
متن کاملPigment composition and optical rotatory dispersion of chloroplast fractions obtained by detergent action.
Plant photosynthesis is considered to consist of photochemical reactions originating from 2 separate pigment systems. Fractionation of the 2 photochemical systems has been demonstrated only recently by detergent treatment of spinach chloroplasts followed by di fferential centri ftugation ( 1, 9). This study shows that the light and heavy fractions obtained by either digitonin or Triton X-100 tr...
متن کاملMultiple Di fferential Cryptanalysis of Round-Reduced PRINCE (Full version)
PRINCE is a lightweight block cipher proposed by Borghoff et al. at Asiacrypt 2012. Due to its originality, novel design and low number of rounds, it has already attracted the attention of a large number of cryptanalysts. Several results on reduced versions have been published to date; the best one is an attack on 8 rounds out of the total number of 12. In this paper we improve this result by t...
متن کاملAn Algorithm to Obtain Possibly Critical Paths in Imprecise Project Networks
We consider criticality in project networks having imprecise activity duration times. It is well known that finding all possibly critical paths of an imprecise project network is an NP-hard problem. Here, based on a method for finding critical paths of crisp networks by using only the forward recursion of critical path method, for the first time an algorithm is proposed which can find all pos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2009 شماره
صفحات -
تاریخ انتشار 2009